Block Data Decomposition for Data-Parallel Programming on a Heterogeneous Workstation Network
نویسندگان
چکیده
We present a block data decomposition algorithm for two-dimensional grid problems. Our method includes load balancing to accommodate heterogeneous processors, and we characterize the conditions that must be met for our partitioning strategy to be of value. While we concentrate on the workstation network model of parallel processing because of its high communication costs and inherent heterogeneity, our method is applicable to other parallel architectures.
منابع مشابه
Heterogeneous Distribution of Computations Solving Linear Algebra Problems on Networks of Heterogeneous Computers
This paper presents and analyzes two different strategies of heterogeneous distribution of computations solving dense linear algebra problems on heterogeneous networks of computers. The first strategy is based on heterogeneous distribution of processes over processors and homogeneous block cyclic distribution of data over the processes. The second is based on homogeneous distribution of process...
متن کاملProblem Decomposition in Parallel Networks
The improving computational speed of workstations makes clusters of these machines attractive for parallel computing. The workstation model of parallel processing, however, presents speciic challenges caused by the latency of the communications network and the workload imbalance that arises from the heterogeneity of the nodes. Because of these issues, data partitioning is critically important f...
متن کاملExperiences with Asynchronous Communication Models in VEOS, a Distributed Programming Facility for Uniprocessor LANs
Like conventional multiprocessors, workstation clusters can provide data sharing and parallel computing. But unlike multiprocessors, these clusters provide flexible connectivity and can tolerate heterogeneous processing elements. Uniprocessor LANs are a common choice for cost-effective computing. The workstation nodes typically run a version of Unix and support common Unix services such as reli...
متن کاملNatural Block Data Decomposition for Heterogeneous Clusters
We propose general purposes natural heuristics for static block and block-cyclic heterogeneous data decomposition over processes of parallel program mapped into multidimensional grid. This heuristics is an extension of the intuitively clear heterogeneous data distribution for one-dimensional case. It is compared to advanced heuristics for heterogeneous data decomposition proposed for solving li...
متن کاملBlock Data Decomposition for Partial - Homogeneous
This paper describes a block data partitioning algorithm suited to parallel processing in a heterogeneous network environment where some of the processors have the same performance capacity. Grid problems are particularly suited to block data partitioning schemes where communication cost is reduced by locating a grid point and its neighbors on the same physical processor whenever possible. Our ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993